منابع مشابه
Stability in E-convex Programming
We define and analyze two kinds of stability in E-convex programming problem in which the feasible domain is affected by an operator E. The first kind of this stability is that the set of all operators E that make an optimal set stable while the other kind is that the set of all operators E that make certain side of the feasible domain still active. 2000 Mathematics Subject Classification. 90Cxx.
متن کاملStability and optimality in parametric convex programming models ∗
Equivalent conditions for structural stability are given for convex programming models in terms of three point-to-set mappings. These mappings are then used to characterize locally optimal parameters. For Lagrange models and, in particular, LFS models the characterizations are given relative to general (possibly unstable) perturbations.
متن کاملQuadratic Growth and Stability in Convex Programming Problems with Multiple Solutions Quadratic Growth and Stability in Convex Programming Problems with Multiple Solutions
Given a convex program with C 2 functions and a convex set S of solutions to the problem, we give a second order condition which guarantees that the problem does not have solutions outside of S. This condition is interpreted as a characterization for the quadratic growth of the cost function. The crucial role in the proofs is played by a theorem describing a certain uniform regularity property ...
متن کاملConvex programming for disjunctive convex optimization
Given a nite number of closed convex sets whose algebraic representation is known, we study the problem of optimizing a convex function over the closure of the convex hull of the union of these sets. We derive an algebraic characterization of the feasible region in a higher-dimensional space and propose a solution procedure akin to the interior-point approach for convex programming.
متن کاملDisciplined Convex Programming∗
Convex programming is a subclass of nonlinear programming (NLP) that unifies and generalizes least squares (LS), linear programming (LP), and convex quadratic programming (QP). This generalization is achieved while maintaining many of the important, attractive theoretical properties of these predecessors. Numerical algorithms for solving convex programs are maturing rapidly, providing reliabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2001
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171201006317